Condorcet winners on median spaces
نویسنده
چکیده
We characterize the outcome of majority voting for single–peaked preferences on median spaces. This large class of preferences covers a variety of multi–dimensional policy spaces including products of lines (e.g. grids), trees, and hypercubes. Our main result is the following: If a Condorcet winner (i.e. a winner in pairwise majority voting) exists, then it coincides with the appropriately defined median (“the median voter”). This result generalizes previous findings which are either restricted to a one–dimensional policy space or to the assumption that any two voters with the same preference peak must have identical preferences. The result applies to models of spatial competition between two political candidates. A bridge to the graph–theoretic literature is built.
منابع مشابه
When Voters Strategize, Approval Voting Elects Condorcet Winners but Condorcet Methods can Elect Condorcet Losers
We show that approval voting strategic equilibria are closely related to honest Condorcet Winners. There exists an approval equilibrium with a clear font-runner F and runner-up R if and only if the F is the clear Condorcet Winner and R the Condorcet runner-up. In contrast, we show that margins-based Condorcet methods can elect a Condorcet Loser with non-zero probibility when voters vote tactica...
متن کاملA note on Condorcet consistency and the median voter
We discuss to which extent the median voter theorem extends to the domain of single-peaked preferences on median spaces. After observing that on this domain a Condorcet winner need not exist, we show that if a Condorcet winner does exist, then it coincides with the median alternative (“the median voter”). Based on this result, we propose two non-cooperative games that implement the unique strat...
متن کاملConnecting pairwise and positional election outcomes
General conclusions relating pairwise tallies with positional (e.g., plurality, antiplurality (“vote-for-two”)) election outcomes were previously known only for the Borda Count. While it has been known since the eighteenth century that the Borda and Condorcet winners need not agree, it had not been known, for instance, in which settings the Condorcet and plurality winners can disagree, or must ...
متن کاملOn the difficulty of computing the winners of a tournament
In voting theory, the result of a paired comparison method as the one suggested by Condorcet can be represented by a tournament, i.e., a complete asymmetric directed graph. When there is no Condorcet winner, i.e., a candidate preferred to any other candidate by a majority of voters, it is not always easy to decide who is the winner of the election. Different methods, called tournament solutions...
متن کاملDueling Bandits: Beyond Condorcet Winners to General Tournament Solutions
Recent work on deriving O(log T ) anytime regret bounds for stochastic dueling bandit problems has considered mostly Condorcet winners, which do not always exist, and more recently, winners defined by the Copeland set, which do always exist. In this work, we consider a broad notion of winners defined by tournament solutions in social choice theory, which include the Copeland set as a special ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 42 شماره
صفحات -
تاریخ انتشار 2014